Collision-Free Poisson Motion Planning in Ultra High-Dimensional Molecular Conformation Spaces
نویسندگان
چکیده
The function of protein, RNA, and DNA is modulated by fast, dynamic exchanges between three-dimensional conformations. Conformational sampling of biomolecules with exact and nullspace inverse kinematics, using rotatable bonds as revolute joints and noncovalent interactions as holonomic constraints, can accurately characterize these native ensembles. However, sampling biomolecules remains challenging owing to their ultra-high dimensional configuration spaces, and the requirement to avoid (self-) collisions, which results in low acceptance rates. Here, we present two novel mechanisms to overcome these limitations. First, we introduce temporary constraints between near-colliding links. The resulting constraint varieties instantaneously redirect the search for collision-free conformations, and couple motions between distant parts of the linkage. Second, we adapt a randomized Poisson-disk motion planner, which prevents local oversampling and widens the search, to ultra-high dimensions. Tests on several model systems show that the sampling acceptance rate can increase from 16% to 70%, and that the conformational coverage in loop modeling measured as average closeness to existing loop conformations doubled. Correlated protein motions identified with our algorithm agree with those from MD simulations. © 2018 Wiley Periodicals, Inc.
منابع مشابه
Efficient Motion Planning in High Dimensional Spaces the Parallelized Z Method
We present a method to plan collision free paths for manipulators with any number of degrees of freedom The method is very e cient as it ommits a complete representa tion of the high dimensional search space Its complexity is linear in the number of degrees of freedom A preprocessing of the geometry data of the robot or the environment is not required In the planning process several more or les...
متن کاملEfficient Motion Planning in High Dimensional Spaces: the Parallelized Z3-method
{ We present a method to plan collision free paths for manipulators with any number of degrees of freedom. The method is very eecient as it ommits a complete representation of the high dimensional search space. Its complexity is linear in the number of degrees of freedom. A preprocessing of the geometry data of the robot or the environment is not required. In the planning process, several more ...
متن کاملPlanning in Discrete and Continuous Spaces: From LTL Tasks to Robot Motions
Enabling robots to accomplish sophisticated tasks requires enhancing their capability to plan at multiple levels of discrete and continuous abstractions. Toward this goal, the proposed approach couples the ability of sampling-based motion planning to handle the complexity arising from high-dimensional robotic systems, nonlinear dynamics, and collision avoidance with the ability of discrete plan...
متن کاملRDT+: A parameter-free algorithm for exact motion planning
In this paper parameter-free concepts for exact motion planning are investigated. With the proposed RDT approach the collision detection parameters of a Rapidlyexploring Dense Tree (RDT) are automatically adjusted until an exact solution can be found. For efficient planning discrete collision detection routines are used within the RDT planner and by verifying the results with exact collision de...
متن کاملSe p 20 06 Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles
We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information about cohomology algebras of configuration spaces. The results of the paper may potentially be used in systems of automatic traffic control.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of computational chemistry
دوره 39 12 شماره
صفحات -
تاریخ انتشار 2018